Performance Comparison of Carry-Lookahead and Carry-Select Adders Based on Accurate and Approximate Additions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Ripple Carry and Carry Lookahead Adders - A Comparative Analysis

Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs) are presented which are compared with accurate RCAs and CLAs for performing a 32-bit addition. The accurate and approximate RCAs and CLAs are implemented using a 32/28nm CMOS process. Approximations ranging from 4to 20-bits are considered for the less significant adder bit positions. The simulation results show that approx...

متن کامل

Delay-Insensitive Carry-Lookahead Adders

Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adders. This paper proposes a delay-insensitive, carrylookahead adder in which the logic complexity is a linear function of n, the number of inputs, and the average computation time is proportional to the logarithm of the lo...

متن کامل

Robust Asynchronous Carry Lookahead Adders

Novel gate level synthesis of robust asynchronous carry lookahead adders based on the notion of section carry is discussed in this paper. For a range of higher order addition operations, the carry lookahead adder is found to exhibit reduced latency than the carry ripple version by 38.6%. However, the latter occupies less area and dissipates less power compared to the former by 37.8% and 17.4% r...

متن کامل

Self-Timed Carry-Lookahead Adders

ÐInteger addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adders. This paper proposes a self-timed carry-lookahead adder in which the logic complexity is a linear function of n, the number of inputs, and the average computation time is proportional to the logarithm of the logarith...

متن کامل

On Fast Carry Select Adders

Abstract -This paper presents an architecture for a high-speed carry select adder with very long bit lengths utilizing a conflict-free bypass scheme. The proposed scheme has almost half the number of transistors and is faster than a conventional carry select adder. A comparative study is also made between the proposed adder and a Manchester carry chain adder which shows that the proposed scheme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2018

ISSN: 2079-9292

DOI: 10.3390/electronics7120369